#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

int n;
int nums[N];

inline void solution() {
    cin >> n;
    for (int i = 0; i < n; i ++ )
        cin >> nums[i];

    vector<PII> status(n);
    vector<int> res;
    int lo = INF, up = -INF;
    for (int i = 0; i < n; i ++ ) status[i] = mk(up, lo);
    for (int i = 0; i < n; i ++ ) {
        status[i].first = up;
        if (up < nums[i]) up = nums[i];
    }
    
    for (int i = n - 1; i >= 0; i -- ) {
        status[i].second = lo;
        if (lo > nums[i]) lo = nums[i];
    }
  
    for (int i = 0; i < n; i ++ ) {
        if (status[i].first < nums[i] && status[i].second > nums[i]) 
            res.push_back(nums[i]);
    }
    cout << res.size() << endl;

    if (res.size() != 0) {
        cout << res[0];
        for (int i = 1; i < res.size(); i ++ ) cout <<  " " << res[i];
        cout << endl;
    } else {
        cout << endl;
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}